New bounds for the b-chromatic number of vertex deleted graphs
نویسندگان
چکیده
A b-coloring of a graph is proper coloring its vertices such that each color class contains vertex adjacent to at least one every other class. The b-chromatic number the largest integer k has with colors. In this work we present lower bounds for vertex-deleted subgraph graph, particularly regarding two important classes, claw-free graphs and chordal graphs. We also get G−{x}, when G large girth.
منابع مشابه
The locating-chromatic number for Halin graphs
Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...
متن کاملThe b-chromatic number and f-chromatic vertex number of regular graphs
The b-chromatic number of a graph G, denoted by b(G), is the largest positive integer k such that there exists a proper coloring for G with k colors in which every color class contains at least one vertex adjacent to some vertex in each of the other color classes, such a vertex is called a dominant vertex. The f -chromatic vertex number of a d-regular graph G, denoted by f(G), is the maximum nu...
متن کاملSome lower bounds for the $L$-intersection number of graphs
For a set of non-negative integers~$L$, the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$. The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملThe locating chromatic number of the join of graphs
Let $f$ be a proper $k$-coloring of a connected graph $G$ and $Pi=(V_1,V_2,ldots,V_k)$ be an ordered partition of $V(G)$ into the resulting color classes. For a vertex $v$ of $G$, the color code of $v$ with respect to $Pi$ is defined to be the ordered $k$-tuple $c_{{}_Pi}(v)=(d(v,V_1),d(v,V_2),ldots,d(v,V_k))$, where $d(v,V_i)=min{d(v,x):~xin V_i}, 1leq ileq k$. If distinct...
متن کاملBounds for the chromatic number of graphs with partial information
We obtain bounds for the chromatic and clique numbers of a simple graph, 3rst in terms of the number of vertices and edges it contains, and then in terms of its vertex degrees. In every case, we examine the tightness of the bounds we obtain. We also brie7y discuss lower bounds for the independence number of a graph in terms of the same parameters. c © 2002 Elsevier Science B.V. All rights reser...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2022
ISSN: ['1872-6771', '0166-218X']
DOI: https://doi.org/10.1016/j.dam.2021.09.023